Largest sparse subgraphs of random graphs
نویسندگان
چکیده
منابع مشابه
Largest sparse subgraphs of random graphs
For the Erdős-Rényi random graph Gn,p, we give a precise asymptotic formula for the size α̂t(Gn,p) of a largest vertex subset inGn,p that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t = t(n) is not too large. In the case of fixed t and p, we find that this value is asymptotically almost surely concentrated on at most two explicitly given points. ...
متن کاملThe Largest Eigenvalue Of Sparse Random Graphs
We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n, p) satisfies almost surely: λ1(G) = (1 + o(1))max{ √ ∆, np}, where ∆ is a maximal degree of G, and the o(1) term tends to zero as max{ √ ∆, np} tends to infinity.
متن کاملLocal resilience of spanning subgraphs in sparse random graphs
For each real γ > 0 and integers ∆ ≥ 2 and k ≥ 1, we prove that there exist constants β > 0 and C > 0 such that for all p ≥ C(log n/n)1/∆ the random graph G(n, p) asymptotically almost surely contains even after an adversary deletes an arbitrary (1/k − γ)-fraction of the edges at every vertex a copy of every nvertex graph with maximum degree at most ∆, bandwidth at most βn and at least C max{p−...
متن کاملDistribution of certain sparse spanning subgraphs in random graphs
We describe a general approach of determining the distribution of spanning subgraphs in the random graph G(n, p). In particular, we determine the distribution of spanning subgraphs of certain given degree sequences, which is a generalisation of the d-factors, of spanning trianglefree subgraphs, of (directed) Hamilton cycles and of spanning subgraphs that are isomorphic to a collection of vertex...
متن کاملInduced subgraphs in sparse random graphs with given degree sequences
Let Gn,d denote the uniformly random d-regular graph on n vertices. For any S ⊂ [n], we obtain estimates of the probability that the subgraph of Gn,d induced by S is a given graph H. The estimate gives an asymptotic formula for any d = o(n1/3), provided that H does not contain almost all the edges of the random graph. The result is further extended to the probability space of random graphs with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.06.012